On rank functions for heaps
نویسنده
چکیده
Motivated by work of Stembridge, we study rank functions for Viennot’s heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in Coxeter groups. To appear in the Journal of Combinatorial Theory, Series A
منابع مشابه
Rank-Pairing Heaps
We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arb...
متن کاملHeaps Simplified
The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single-elimination tournaments, we obtain the binomial queue, a classical heap implementation, in a simple and natural way....
متن کاملAn empirical analysis of algorithmsfor constructing a minimum spanning treeBernard
We compare algorithms for the construction of a minimum spanning tree through large-scale experimentation on randomly generated graphs of diierent structures and diierent densities. In order to extrapolate with conndence, we use graphs with up to 130,000 nodes (sparse) or 750,000 edges (dense). Algorithms included in our experiments are Prim's algorithm (implemented with a variety of priority q...
متن کاملRank-Relaxed Weak Queues: Faster than Pairing and Fibonacci Heaps?
A run-relaxed weak queue by Elmasry et al. (2005) is a priority queue data structure with insert and decrease-key in O(1) as well as delete and delete-min in O(log n) worst-case time. One further advantage is the small space consumption of 3n+O(log n) pointers. In this paper we propose rank-relaxed weak queues, reducing the number of rank violations nodes for each level to a constant, while pro...
متن کاملA Tight Lower Bound for Decrease-Key in the Pure Heap Model
We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a O(log n) amortized-time extract-min operation) must spend Ω(log logn) amortized time on the decrease-key operation. Our result shows that sort heaps as well as pure-heap variants of numerous other heaps have asymptotically optimal decrease-key ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 102 شماره
صفحات -
تاریخ انتشار 2003